Dual gradient method for linearly constrained,strongly convex,separable mathematical programming problems

A new dual gradient method is given to solve linearly constrained, strongly convex, separable mathematical programming problems. The dual problem can be decomposed into one-dimensional problems whose solutions can be computed extremely easily. The dual objective function is shown to have a Lipschitz continuous gradient, and therefore a gradient-type algorithm can be used for solving the dual problem. The primal optimal solution can be obtained from the dual optimal solution in a straightforward way. Convergence proofs and computational results are given.     

Banach空间中线性流形上的度量投影的表达式

借助于正规对偶映射,建立了一般Banach空间中线性流形上的(集值)度量投影存在的 充要条件,同时给出了度量投影的表达式和点到线性流形上的距离公式.这些本质地推广和改进了 王玉文和于金凤在空间自反、严格凸和光滑强假定下的相应结果.     

Generalized Nonlinear Lagrangian Formulation for Bounded Integer Programming

Several nonlinear Lagrangian formulations have been recently proposed for bounded integer programming problems. While possessing an asymptotic strong duality property, these formulations offer a success guarantee for the identification of an optimal primal solution via a dual search. Investigating common features of nonlinear Lagrangian formulations in constructing a nonlinear support for nonconvex piecewise constant perturbation function, this paper proposes a generalized nonlinear Lagrangian formulation of which many existing nonlinear Lagrangian formulations become special cases.     

E -Theoretic Duality for Higher Rank Graph Algebras

We prove that there is a Poincaré type duality in E-theory between higher rank graph algebras associated with a higher rank graph and its opposite correspondent. We obtain an r-duality, that is the fundamental classes are in E^r. The basic tools are a higher rank Fock space and higher rank Toeplitz algebra which has a more interesting ideal structure than in the rank 1 case. The K-homology fundamental class is given by an r-fold exact sequence whereas the K-theory fundamental class is given by a homomorphism. The E-theoretic products are essentially pull-backs so that the computation is done at the level of exact sequences. Mathematics Subject Classification (2000): 46L80.     

广义幂级数环的Morita对偶

设A,B是有单位元的环, (S,≤)是有限生成的Artin的严格全序幺半群, AMB是双模.本文证明了双模[[AS,≤]][MS,≤][[BS,≤]]定义一个Morita对偶当且仅当 AMB定义一个Morita对偶且A是左noether的,B是右noether的.因此A上的广 义幂级数环[[AS,≤]]具有Morita对偶当且仅当A是左noether的且具有由双模AMB 诱导的Morita对偶,使得B是右noether的.     

有界整规划中的渐近强非线性对偶

本文提出了一种整数规划中的指数一对数对偶.证明了此指数-对数对偶方法具有的渐近强对偶性质,并提出了不需要进行对偶搜索来解原整数规划问题的方法.特别地,当选取合适的参数和对偶变量时,原整数规划问题的解可以通过解一个非线性松弛问题来得到.对具有整系数目标函数及约束函数的多项式整规划问题,给出了参数及对偶变量的取法.     

On Duality for a Class of Quasiconcave Multiplicative Programs

Multiplicative programs are a difficult class of nonconvex programs that have received increasing attention because of their many applications. However, given their nonconvex nature, few theoretical results are available. In this paper, we study a particular case of these programs which involves the maximization of a quasiconcave function over a linear constraint set. Using results from conjugate function theory and generalized geometric programming, we derive a complete duality theory. The results are further specialized to linear multiplicative programming.     

Complex nonlinear programming: Duality with invexity and equivalent real programs

Necessary conditions for optimality in polyhedral-cone constrained nonlinear complex programs are shown to be sufficient under the assumption of a particular form of invexity. Duality results are thus extended for a Wolfe-type dual. The formulation of real programs equivalent to complex programs via generating matrices is presented.     

Duality in the cohomology of crystalline local systems

Let k be a perfect field of a positive characteristic p, K-the fraction field of the ring of Witt vectors W(k) Let X be a smooth and proper scheme over W(k). We present a candidate for a cohomology theory with coefficients in crystalline local systems: p -adic étale local systems on X_K characterized by associating to them so called Fontaine-crystals on the crystalline site of the special fiber X _k. We show that this cohomology satysfies a duality theorem.     

Zero duality gap for a class of nonconvex optimization problems

By an equivalent transformation using thepth power of the objective function and the constraint, a saddle point can be generated for a general class of nonconvex optimization problems. Zero duality gap is thus guaranteed when the primal-dual method is applied to the constructed equivalent form.The author very much appreciates the comments from Prof. Douglas J. White.